A linear translation from CTL* to the first-order modal μ -calculus
نویسندگان
چکیده
The modal μ-calculus is a very expressive temporal logic. In particular, logics such as LTL, CTL and CTL* can be translated into the modal μ-calculus, although existing translations of LTL and CTL* are at least exponential in size. We show that an existing simple first-order extension of the modal μ-calculus allows for a linear translation from LTL. Furthermore, we show that solving the translated formulae is as efficient as the best known methods to solve LTL formulae directly.
منابع مشابه
A linear translation from LTL to the first-order modal μ-calculus
The modal μ-calculus is a very expressive temporal logic. In particular, logics such as LTL, CTL and CTL* can be translated into the modal μ-calculus, although existing translations of LTL and CTL* are at least exponential in size. We show that an existing simple first-order extension of the modal μ-calculus allows for a linear translation from LTL. Furthermore, we show that solving the transla...
متن کاملFormalising the translation of CTL into Lμ
The translation of the temporal logic CTL [2] into the modal μ-calculus Lμ [10] is formalised in the HOL theorem prover [8].
متن کاملComplexity of Monadic inf-datalog. Application to temporal logic
In [] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal μ-calculus and Modal μ-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program comp...
متن کاملCitation for the Test-of-Time Award from LICS 1995
The propositional μ-calculus (now more commonly known as the modal μ-calculus) was first published in 1983 by D. Kozen, although the system had been studied much earlier by J. de Bakker and D. Scott (unpublished notes, 1969). The system subsumes many popular propositional logics of programs, including linear temporal logic, computation tree logic CTL*, and propositional dynamic logic. Kozen pro...
متن کاملObjects, Types and Modal Logics
In this paper we present a modal logic for describing properties of terms in the object calculus of Abadi and Cardelli [AC96]. The logic is essentially the modal mu-calculus of [Koz83]. The fragment allows us to express the temporal modalities of the logic CTL [BAMP83]. We investigate the connection between the type system Ob1<:μ and the mu-calculus, providing a translation of types into modal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011